<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    234. Palindrome Linked List
   </h1>
   <p>
    Given a singly linked list, determine if it is a palindrome.
   </p>
   <p>
    <strong>
     Example 1:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> 1-&gt;2
<strong>Output:</strong> false</pre>
   <p>
    <strong>
     Example 2:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> 1-&gt;2-&gt;2-&gt;1
<strong>Output:</strong> true</pre>
   <p>
    <b>
     Follow up:
    </b>
    <br>
    Could you do it in O(n) time and O(1) space?
   </p>
  </div>
  <div>
   <h1 class="question_title">
    234. 回文链表
   </h1>
   <p>
    请判断一个链表是否为回文链表。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre><strong>输入:</strong> 1-&gt;2
<strong>输出:</strong> false</pre>
   <p>
    <strong>
     示例 2:
    </strong>
   </p>
   <pre><strong>输入:</strong> 1-&gt;2-&gt;2-&gt;1
<strong>输出:</strong> true
</pre>
   <p>
    <strong>
     进阶：
    </strong>
    <br>
    你能否用&nbsp;O(n) 时间复杂度和 O(1) 空间复杂度解决此题？
   </p>
  </div>
 </body>
</html>